Sesqui-Pushout Rewriting
نویسندگان
چکیده
Sesqui-pushout (sqpo) rewriting—“sesqui” means “one and a half” in Latin—is a new algebraic approach to abstract rewriting in any category. sqpo rewriting is a deterministic and conservative extension of double-pushout (dpo) rewriting, which allows to model “deletion in unknown context”, a typical feature of single-pushout (spo) rewriting, as well as cloning. After illustrating the expressiveness of the proposed approach through a case study modelling an access control system, we discuss sufficient conditions for the existence of final pullback complements and we analyze the relationship between sqpo and the classical dpo and spo approaches.
منابع مشابه
LNCS 4178 - Sesqui-Pushout Rewriting
Sesqui-pushout (sqpo) rewriting—“sesqui” means “one and a half” in Latin—is a new algebraic approach to abstract rewriting in any category. sqpo rewriting is a deterministic and conservative extension of double-pushout (dpo) rewriting, which allows to model “deletion in unknown context”, a typical feature of single-pushout (spo) rewriting, as well as cloning. After illustrating the expressivene...
متن کاملSesqui-Pushout Rewriting with Type Refinements
Sesqui-pushout rewriting is an algebraic graph transformation approach that provides mechanisms for vertex cloning. If a vertex gets cloned, the original and the copy obtain the same context, i.e. all incoming and outgoing edges of the original are copied as well. This behaviour is not satisfactory in practical examples which require more control over the context cloning process. In this paper,...
متن کاملPolymorphic Sesqui-Pushout Graph Rewriting
The paper extends Sesqui-Pushout Graph Rewriting (SqPO) by polymorphism, a key concept in object-oriented design. For this purpose, the necessary theory for rule composition and decomposition is elaborated on an abstract categorical level. The results are applied to model rule extension and type dependent rule application. This extension mechanism qualifies SqPO – with its very useful copy mech...
متن کاملGraph rewriting with polarized cloning
We tackle the problem of graph transformation with a particular focus on node cloning. We propose a graph rewriting framework where nodes can be cloned zero, one or more times. A node can be cloned together with all its incident edges, with only the outgoing edges, with only the incoming edges or without any of the incident edges. We thus subsume previous works such as the sesqui-pushout, the h...
متن کاملGraph Transformation with Focus on Incident Edges
We tackle the problem of graph transformation with particular focus on node cloning. We propose a new approach to graph rewriting, called polarized node cloning, where a node may be cloned together with either all its incident edges or with only its outgoing edges or with only its incoming edges or with none of its incident edges. We thus subsume previous works such as the sesqui-pushout, the h...
متن کامل